| 1. Identity statement | |
| Reference Type | Conference Paper (Conference Proceedings) |
| Site | sibgrapi.sid.inpe.br |
| Holder Code | ibi 8JMKD3MGPEW34M/46T9EHH |
| Identifier | 6qtX3pFwXQZeBBx/vStjr |
| Repository | sid.inpe.br/banon/2002/10.25.09.20 |
| Last Update | 2002:09.23.03.00.00 (UTC) administrator |
| Metadata Repository | sid.inpe.br/banon/2002/10.25.09.20.33 |
| Metadata Last Update | 2022:06.14.00.11.55 (UTC) administrator |
| DOI | 10.1109/SIBGRA.2002.1167141 |
| Citation Key | GopiKris:2002:FaEfPr |
| Title | Fast and efficient projection-based approach for surface reconstruction  |
| Year | 2002 |
| Access Date | 2024, Apr. 27 |
| Number of Files | 1 |
| Size | 5438 KiB |
| 2. Context | |
| Author | 1 Gopi, M. 2 Krishnan, Shankar |
| Editor | Gonçalves, Luiz Marcos Garcia Musse, Soraia Raupp Comba, João Luiz Dihl Giraldi, Gilson Dreux, Marcelo |
| Conference Name | Brazilian Symposium on Computer Graphics and Image Processing, 15 (SIBGRAPI) |
| Conference Location | Fortaleza, CE, Brazil |
| Date | 10-10 Oct. 2002 |
| Publisher | IEEE Computer Society |
| Publisher City | Los Alamitos |
| Book Title | Proceedings |
| Tertiary Type | Full Paper |
| Organization | SBC - Brazilian Computer Society |
| History (UTC) | 2008-07-17 14:10:48 :: administrator -> banon :: 2008-08-26 15:21:23 :: banon -> administrator :: 2009-08-13 20:36:46 :: administrator -> banon :: 2010-08-28 20:00:07 :: banon -> administrator :: 2022-06-14 00:11:55 :: administrator -> :: 2002 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Version Type | finaldraft |
| Abstract | We present a fast and memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P {R}^3. Nothing is assumed about the geometry, topology or presence of boundaries in the data set except that P is sampled from a real manifold surface. The speed of our algorithm is derived from a projection-based approach we use to determine the incident faces on a point. Our algorithm has successfully reconstructed the surfaces of unorganized point clouds of sizes varying from 10,000 to 100,000 in about 3--30 seconds on a 250 MHz, R10000 SGI Onyx2. Our technique can be specialized for different kinds of input and applications. For example, our algorithm can be specialized to handle data from height fields like terrain and range scan, even in the presence of noise. We have successfully generated meshes for range scan data of size 900,000 points in less than 40 seconds. |
| Arrangement 1 | urlib.net > SDLA > Fonds > SIBGRAPI 2002 > Fast and efficient... |
| Arrangement 2 | urlib.net > SDLA > Fonds > Full Index > Fast and efficient... |
| doc Directory Content | access |
| source Directory Content | there are no files |
| agreement Directory Content | there are no files |
| 4. Conditions of access and use | |
| data URL | http://urlib.net/ibi/6qtX3pFwXQZeBBx/vStjr |
| zipped data URL | http://urlib.net/zip/6qtX3pFwXQZeBBx/vStjr |
| Language | en |
| Target File | 102.pdf |
| User Group | administrator |
| Visibility | shown |
| 5. Allied materials | |
| Next Higher Units | 8JMKD3MGPEW34M/46QCSHP 8JMKD3MGPEW34M/4742MCS |
| Citing Item List | sid.inpe.br/sibgrapi/2022/05.01.04.11 6 |
| Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
| 6. Notes | |
| Notes | The conference was held in Fortaleza, CE, Brazil, from October 7 to 10. |
| Empty Fields | affiliation archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage e-mailaddress edition electronicmailaddress format group isbn issn keywords label lineage mark mirrorrepository nextedition numberofvolumes orcid pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume |